Single electron based binary multipliers with overflow detection
نویسندگان
چکیده
منابع مشابه
Single electron based binary multipliers with overflow detection
Low power consumption, high operating speed and high integration density equipment(s) are financially indispensable in modern Electronics. Single Electron Device (SED) is one such equipment. Single Electron Devices are capable of controlling the transport of only an electron. A single electron is sufficient to store information in the SED. This paper presents the approach for designing multipli...
متن کاملPhotoionisation detection of single 87Rb-atoms using channel electron multipliers
Fast and efficient detection of single atoms is a universal requirement concerning modern experiments in atom physics, quantum optics, and precision spectroscopy. In particular for future quantum information and quantum communication technologies, the efficient readout of qubit states encoded in single atoms or ions is an elementary prerequisite. The rapid development in the field of quantum op...
متن کاملThe detection efficiency of electron multipliers
The variation of the detection efficiency of electron multipliers used in the pulse-counting mode is investigated as a function of the average gain per dynode, the energy of the electrons being detected and the applied voltage. It is assumed that the pulse-height distributions can be obtained from Polya statistics and that the universal yield curve for secondary emission is applicable. Results ...
متن کاملSingle Electron Detection with GEM
Sensitivity to single electrons is requested in detectors based on the electron counting technique, measuring very low radiation-deposited energies. It is also required in novel large-area gaseous photomultipliers, employing solid photocathodes and gaseous electron multipliers. The Gas Electron Multiplier (GEM) has been considered for these applications, and we report on its properties when ope...
متن کاملError Detection in Polynomial Basis Multipliers over Binary Extension Fields
In many of cryptographic schemes, the most time consuming basic arithmetic operation is the finite field multiplication and its hardware implementation may require millions of logic gates. It is a complex and costly task to develop such large finite field multipliers which will always yield error free outputs. In this effect, this paper considers fault tolerant multiplication in finite fields. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering, Science and Technology
سال: 2010
ISSN: 2141-2839,2141-2820
DOI: 10.4314/ijest.v1i1.58061